Browsing by Subject "Propositional logic"

Now showing items 1-6 of 6

    • Conference Object  

      Argumentation for propositional logic and nonmonotonic reasoning 

      Kakas, Antonis C.; Toni, F.; Mancarella, P. (CEUR-WS, 2014)
      Argumentation has played a significant role in understanding and unifying under a common framework different forms of defeasible reasoning in AI. Argumentation is also close to the original inception of logic as a framework ...
    • Article  

      Classical methods in nonmonotonic reasoning 

      Dimopoulos, Yannis (1994)
      In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...
    • Article  

      The computational value of joint consistency 

      Dimopoulos, Yannis (1994)
      In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied ...
    • Conference Object  

      Integer programs and valid inequalities for planning problems 

      Bockmayr, A.; Dimopoulos, Yannis (Springer Verlag, 2000)
      Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinato-rial search problem. The underlying representation language is basically propositional logic. While ...
    • Article  

      On Argumentation Logic and Propositional Logic 

      Kakas, Antonis C.; Mancarella, P.; Toni, F. (2017)
      This paper studies the relationship between Argumentation Logic (AL), a recently defined logic based on the study of argumentation in AI, and classical Propositional Logic (PL). In particular, it shows that AL and PL are ...
    • Conference Object  

      Preferred arguments are harder to compute than stable extensions 

      Dimopoulos, Yannis; Nebel, B.; Toni, F. (1999)
      Based on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, ...